We studied a generalized question: chronic diseases like ME/CFS and long COVID exhibit high heterogeneity with multifactorial etiology and progression, complicating diagnosis and treatment. To address this, we developed BioMapAI, an explainable Deep Learning framework using the richest longitudinal multi-omics dataset for ME/CFS to date. This dataset includes gut metagenomics, plasma metabolome, immune profiling, blood labs, and clinical symptoms. By connecting multi-omics to a symptom matrix, BioMapAI identified both disease- and symptom-specific biomarkers, reconstructed symptoms, and achieved state-of-the-art precision in disease classification. We also created the first connectivity map of these omics in both healthy and disease states and revealed how microbiome-immune-metabolome crosstalk shifted from healthy to ME/CFS.

Achieving global space-air-ground integrated network (SAGIN) access only with CubeSats presents significant challenges such as the access sustainability limitations in specific regions (e.g., polar regions) and the energy efficiency limitations in CubeSats. To tackle these problems, high-altitude long-endurance unmanned aerial vehicles (HALE-UAVs) can complement these CubeSat shortcomings for providing cooperatively global access sustainability and energy efficiency. However, as the number of CubeSats and HALE-UAVs, increases, the scheduling dimension of each ground station (GS) increases. As a result, each GS can fall into the curse of dimensionality, and this challenge becomes one major hurdle for efficient global access. Therefore, this paper provides a quantum multi-agent reinforcement Learning (QMARL)-based method for scheduling between GSs and CubeSats/HALE-UAVs in order to improve global access availability and energy efficiency. The main reason why the QMARL-based scheduler can be beneficial is that the algorithm facilitates a logarithmic-scale reduction in scheduling action dimensions, which is one critical feature as the number of CubeSats and HALE-UAVs expands. Additionally, individual GSs have different traffic demands depending on their locations and characteristics, thus it is essential to provide differentiated access services. The superiority of the proposed scheduler is validated through data-intensive experiments in realistic CubeSat/HALE-UAV settings.

Adversarial examples are helpful for analyzing and improving the robustness of text classifiers. Generating high-quality adversarial examples is a challenging task as it requires generating fluent adversarial sentences that are semantically similar to the original sentences and preserve the original labels, while causing the classifier to misclassify them. Existing methods prioritize misclassification by maximizing each perturbation's effectiveness at misleading a text classifier; thus, the generated adversarial examples fall short in terms of fluency and similarity. In this paper, we propose a rewrite and rollback (R&R) framework for adversarial attack. It improves the quality of adversarial examples by optimizing a critique score which combines the fluency, similarity, and misclassification metrics. R&R generates high-quality adversarial examples by allowing exploration of perturbations that do not have immediate impact on the misclassification metric but can improve fluency and similarity metrics. We evaluate our method on 5 representative datasets and 3 classifier architectures. Our method outperforms current state-of-the-art in attack success rate by +16.2%, +12.8%, and +14.0% on the classifiers respectively. Code is available at https://github.com/DAI-Lab/fibber

In this paper, we design a navigation policy for multiple unmanned aerial vehicles (UAVs) where mobile base stations (BSs) are deployed to improve the data freshness and connectivity to the Internet of Things (IoT) devices. First, we formulate an energy-efficient trajectory optimization problem in which the objective is to maximize the energy efficiency by optimizing the UAV-BS trajectory policy. We also incorporate different contextual information such as energy and age of information (AoI) constraints to ensure the data freshness at the ground BS. Second, we propose an agile deep reinforcement learning with experience replay model to solve the formulated problem concerning the contextual constraints for the UAV-BS navigation. Moreover, the proposed approach is well-suited for solving the problem, since the state space of the problem is extremely large and finding the best trajectory policy with useful contextual features is too complex for the UAV-BSs. By applying the proposed trained model, an effective real-time trajectory policy for the UAV-BSs captures the observable network states over time. Finally, the simulation results illustrate the proposed approach is 3.6% and 3.13% more energy efficient than those of the greedy and baseline deep Q Network (DQN) approaches.

In recent years, multi-access edge computing (MEC) is a key enabler for handling the massive expansion of Internet of Things (IoT) applications and services. However, energy consumption of a MEC network depends on volatile tasks that induces risk for energy demand estimations. As an energy supplier, a microgrid can facilitate seamless energy supply. However, the risk associated with energy supply is also increased due to unpredictable energy generation from renewable and non-renewable sources. Especially, the risk of energy shortfall is involved with uncertainties in both energy consumption and generation. In this paper, we study a risk-aware energy scheduling problem for a microgrid-powered MEC network. First, we formulate an optimization problem considering the conditional value-at-risk (CVaR) measurement for both energy consumption and generation, where the objective is to minimize the loss of energy shortfall of the MEC networks and we show this problem is an NP-hard problem. Second, we analyze our formulated problem using a multi-agent stochastic game that ensures the joint policy Nash equilibrium, and show the convergence of the proposed model. Third, we derive the solution by applying a multi-agent deep reinforcement learning (MADRL)-based asynchronous advantage actor-critic (A3C) algorithm with shared neural networks. This method mitigates the curse of dimensionality of the state space and chooses the best policy among the agents for the proposed problem. Finally, the experimental results establish a significant performance gain by considering CVaR for high accuracy energy scheduling of the proposed model than both the single and random agent models.

Google is making headway on a landmark project that hopes to one day rid the world of disease-carrying mosquitoes that can be a nuisance to some regions and dangerously fatal to others. The'Debug Fresno' project, launched by Google parent company Alphabet's Verily life sciences unit, has been releasing millions of Aedes Aegypti mosquitoes in northern California's Fresno county. Approximately 80,000 of the tiny, engineered mosquitoes, which have a wingspan of just a few millimeters, are set free from a roving van using a'mosquito cannon' after being infected with a bacteria in the hopes of killing off the entire mosquito population in that area. The'Debug Fresno' project, launched by Alphabet's Verily unit, has been releasing tens of thousands of Aedes Aegypti mosquitoes (pictured) in northern California's Fresno county The Aedes aegypti has white markings on its legs and a marking in the form of a lyre on the upper surface of its thorax. The mosquito originated in Africa but is now found in tropical and subtropical regions throughout the world.

It could be the plot of a post-apocalyptic science fiction film – a tech firm is set to release 20 million bacteria-filled mosquitoes in the heart of California. But, the experts spearheading the effort say it could finally provide a way to take on the'deadliest animal in the world,' preventing mosquito-borne illnesses and ultimately saving lives. Unlike other modern approaches to eradicate'bad bugs,' the technique launched today by Verily's Debug project doesn't rely on genetic engineering; instead, it uses a naturally occurring bacteria that causes them to produce dud eggs. A tech firm is set to release 20 million bacteria-filled mosquitos in the heart of California. The technique launched today by Verily's Debug project uses a naturally occurring bacteria that causes them to produce dud eggs Smart traps - Roughly the size of large birdhouses, these smart traps use robotics, infrared sensors, machine learning and cloud computing to help health officials keep tabs on potential disease carriers.

Technology firms s are bringing automation and robotics to the age-old task of battling mosquitoes. Firms, including Microsoft, are forming partnerships with public health officials in several US states to test new high-tech tools. They are hoping their efforts will help to spread Zika and other mosquito-borne maladies worldwide. American technology companies are bringing automation and robotics to the age-old task of battling mosquitoes (pictured). Smart traps - Roughly the size of large birdhouses, these smart traps use robotics, infrared sensors, machine learning and cloud computing to help health officials keep tabs on potential disease carriers.

We develop a framework that allows the use of the multi-level Monte Carlo (MLMC) methodology (Giles 2015) to calculate expectations with respect to the invariant measures of ergodic SDEs. In that context, we study the (over-damped) Langevin equations with strongly convex potential. We show that, when appropriate contracting couplings for the numerical integrators are available, one can obtain a time-uniform estimates of the MLMC variance in stark contrast to the majority of the results in the MLMC literature. As a consequence, one can approximate expectations with respect to the invariant measure in an unbiased way without the need of a Metropolis- Hastings step. In addition, a root mean square error of $\mathcal{O}(\epsilon)$ is achieved with $\mathcal{O}(\epsilon^{-2})$ complexity on par with Markov Chain Monte Carlo (MCMC) methods, which however can be computationally intensive when applied to large data sets. Finally, we present a multilevel version of the recently introduced Stochastic Gradient Langevin (SGLD) method (Welling and Teh, 2011) built for large datasets applications. We show that this is the first stochastic gradient MCMC method with complexity $\mathcal{O}(\epsilon^{-2}|\log {\epsilon}|^{3})$, which is asymptotically an order $\epsilon$ lower than the $ \mathcal{O}(\epsilon^{-3})$ complexity of all stochastic gradient MCMC methods that are currently available. Numerical experiments confirm our theoretical findings.

Causality discovery has been one of the core tasks in scientific research since the beginning of human scientific history. In the age of data tsunami, the causality discovery task involves identification of causality among millions of variables which cannot be done manually by humans. However, the identification of causality relationships using artificial intelligence and statistical techniques in non-experimental settings faces several challenges. In this work, we address three of the challenges regarding Granger causality, one of the most popular causality inference techniques. First, we analyze the consistency of two most popular Granger causality techniques and show that the significance test is not consistent in high dimensions. Second, we review our nonparametric generalization of the Lasso-Granger technique called Generalized Lasso Granger (GLG) to uncover Granger causality relationships among irregularly sampled time series. Finally, we describe two techniques to uncover the casual dependence in non-linear datasets. Extensive experiments are provided to show the significant advantages of the proposed algorithms over their state-of-the-art counterparts.